Equilibrium Customer Strategies and Social-profit Maximization in the Single Server Constant Retrial Queue
نویسنده
چکیده
We consider the single server constant retrial queue with a Poisson arrival process and exponential service and retrial times. This system has not waiting space, so the customers that find the server busy are forced to abandon the system, but they can leave their contact details. Hence, after a service completion, the server seeks for a customer among those that have unsuccessfully applied for service but left their contact details, at a constant retrial rate. We assume that the arriving customers that find the server busy decide whether to leave their contact details or to balk based on a natural reward-cost structure, which incorporates their desire for service as well as their unwillingness to wait. We examine the customers’ behavior and we identify the Nash equilibrium joining strategies. We also study the corresponding social and profit maximization problems. We consider separately the observable case where the customers get informed about the number of customers waiting for service and the unobservable case where they do not receive this information. Several extensions of the model are also discussed.
منابع مشابه
Stochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملUnreliable bulk retrial queues with delayed repairs and modified vacation policy
The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...
متن کاملOptimal balking strategies and pricing for the single server Markovian queue with compartmented waiting space
We consider the single server Markovian queue and we assume that arriving customers decide whether to enter the system or balk based on a natural rewardcost structure, which incorporates their desire for service as well as their unwillingness to wait. We suppose that the waiting space of the system is partitioned in compartments of fixed capacity for a customers. Before making his decision, a c...
متن کاملM/M/1 retrial queue with working vacations and negative customer arrivals
The M/M/1 retrial queue with working vacations and negative customers is introduced. The arrival processes of positive customers and negative customers are Poisson. Upon the arrival of a positive customer, if the server is busy the customer would enter an orbit of infinite size and the orbital customers send their requests for service with a constant retrial rate. The single server takes an exp...
متن کاملPriority Distribution in a Queue with Service Discrimination
We consider a memoryless single server queue with two classes of customers, customer types are distinguished by the payments and service discrimination (i.e. customers of the two classes are served with different service rates). Based on the different fixed payments of the two classes, we derive the priority distribution schemes from the perspective of profit maximization and social optimizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012